An Efficient Algorithm for Generating Composition Tables for Qualitative Spatial Relations

نویسندگان

  • Chaman L. Sabharwal
  • Jennifer L. Leopold
چکیده

Qualitative Spatial Reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not pertinent or not available. The automated derivation of such logical inferences becomes a binary constraint satisfaction problem; binary relations can be formulated as a region-based qualitative reasoning problem involving disjunctive constraints. It has been proved [1] that composition-based reasoning is complete for deriving inferences in various calculi; hence a composition table is a central part of QSR and consistency-checking. Previously developed algorithms to construct such tables have required manual or, at best, semi-automatic analysis. Herein we present a new divideand-conquer algorithm to automatically construct a composition table for spatial relations, and apply it to the 3D region connection calculus, VRCC3D+. This validates the hypothesis that consistency-checking, entailment checking, and occlusion can be supported in 3D.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing Qualitative Spatio-Temporal Calculi using Algebraic Geometry

Qualitative spatial reasoning is based on calculi which comprise relations and operation tables that encode operations like relation composition. Designing a calculus involves determining these tables and analyzing reasoning properties—a demanding task that is susceptible to errors if performed manually. This paper is concerned with automating computation of operation tables and analysis of qua...

متن کامل

9+-Intersection Calculi for Topological Reasoning on Heterogeneous Objects

This paper develops a series of qualitative spatial calculi that feature topological relations. While most qualitative spatial calculi have targeted spatial relations between single-type objects, our calculi support spatial relations between heterogeneous combinations of objects. Thus, with our calculi, we can disambiguate topological arrangements of objects without regard to the types of the o...

متن کامل

On A Semi-Automatic Method for Generating Composition Tables

Originating from Allen’s Interval Algebra, composition-based reasoning has been widely acknowledged as the most popular reasoning technique in qualitative spatial and temporal reasoning. Given a qualitative calculus (i.e. a relation model), the first thing we should do is to establish its composition table (CT). In the past three decades, such work is usually done manually. This is undesirable ...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables

In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the past 25 years, a large number of calculi for efficient reasoning about spatial and temporal entities has been developed. Reasoning techniques developed for these constraint calculi typically rely on so-called composition tables of the calculus at hand, which allow for replacing semantic reasoning by sym...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013